//referencia: http://javafree.uol.com.br/topic-868216-Algoritmo-de-Euclides.html
public class Mdc
{
	private int num1;
	private int num2;
	
	public Mdc(int num1, int num2)
	{
		this.num1 = num1;
		this.num2 = num2;
	}
	public int getMdc()
	{
		int auxiliar = 1;
		
		if(this.num1 >= this.num2)
		{
			while(auxiliar != 0)
			{
				auxiliar = num1%num2;
				num1 = num2;
				num2 = auxiliar;
			}
		}
		return num1;
	}
}
